Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
نویسندگان
چکیده
منابع مشابه
A Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing
In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...
متن کاملa flexible job shop scheduling problem with controllable processing times to optimize total cost of delay and processing
in this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. the main idea is that the processing times of operations may be controlled by consumptions of additional resources. the purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. the proposed model, flexibl...
متن کاملScheduling with Controllable Processing Times
In today's industrial world, demand nature is changing where the customers are looking for a high variety of products. In order to meet varying customer demands, the firms should be flexible enough to produce parts in an efficient way. The flexible manufacturing systems have emerged with the progress in manufacturing technology. A flexible manufacturing system (FMS) is a computer-controlled pro...
متن کاملSingle machine scheduling with controllable processing times to minimize total tardiness and earliness
0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.08.019 ⇑ Corresponding author. Tel.: +98 111 2197584; fax E-mail addresses: [email protected] (V. Kay com (I. Mahdavi), [email protected] (G In most deterministic scheduling problems job processing times are considered as invariable and known in advance. Single machine scheduling problem with controllable proces...
متن کاملJob Shop Scheduling Problems with Controllable Processing Times
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2018
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-018-0686-2